Growing Competitive Ant Algorithm for Multi-Objective 0-1 Programming
نویسندگان
چکیده
منابع مشابه
Linearization of multi-objective multi-quadratic 0-1 programming problems
A linearization technique is developed for multi-objective multi-quadratic 0-1 programming problems with linear and quadratic constraints to reduce it to multi-objective linear mixed 0-1 programming problems. The method proposed in this paper needs only O (kn) additional continuous variables where k is the number of quadratic constraints and n is the number of initial 0-1 variables.
متن کاملUsing Imperialist competitive algorithm optimization in multi-response nonlinear programming
The quality of manufactured products is characterized by many controllable quality factors. These factors should be optimized to reach high quality products. In this paper we try to find the controllable factors levels with minimum deviation from the target and with a least variation. To solve the problem a simple aggregation function is used to aggregate the multiple responses functions then a...
متن کاملMOEICA: Enhanced multi-objective optimization based on imperialist competitive algorithm
In this paper, a multi-objective enhanced imperialist competitive algorithm (MOEICA) is presented. The main structures of the original ICA are employed while some novel approaches are also developed. Other than the non-dominated sorting and crowding distance methods which are used as the main tools for comparing and ranking solutions, an auxiliary comparison approach called fuzzy possession is ...
متن کاملAn Improved Multi-objective Evolutionary Algorithm for Multi- Objective 0/1 Knapsack Problem
To further enhance the distribution uniformity and extensiveness of the solution sets and to ensure effective convergence of the solution sets to the Pareto front, we proposed a MOEA approach based on a clustering mechanism. We named this approach improved multi-objective evolutionary algorithm (LMOEA). This algorithm uses a clustering technology to compute and maintain the distribution and div...
متن کاملA Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem
In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2011
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2011.11.147